1. Each interpretation is responsible for different distributive laws in the Boolean algebra. 2. Generalization of distributive law leads to a large family of fast algorithms. 3. The distributive laws are among the axioms for sets or the switching algebra. 4. Now, using the distributive law , we see that 5. This distributive law " is not equivalent " to its dual statement 6. Use the distributive law to turn that expression into a sum of products. 7. See : distributive law between monads. 8. Other properties follow from the distributive law , for example equals if and only if equals or equals. 9. The distributive law is sometimes stated as an axiom, but in fact it follows from the existence of relative pseudo-complements. 10. Failure of one of the two distributive laws brings about near-rings and near-fields instead of rings and division rings respectively.
Mobile